基于SQP法的助推-滑翔导弹助推段弹道优化研究

轨迹优化是飞行器总体优化设计中的重要组成部分,它贯穿于飞行器的整个设计过程。高超声速助推-滑翔导弹的弹道优化问题涉及攻角、法向过载、最大动压等多种约束条件,是一种复杂的最优控制问题。序列二次规划法（SQP）是解决该类问题行之有效的数值优化方法。本文利用SQP算法对助推-滑翔导弹助推段进行弹道优化,为这一高超声速飞行器的整体结构设计提供了有益的参考。     

Biased retro-proportional navigation law for interception of high-speed targets with angular constraint

A new guidance law, called biased retro proportional navigation (BRPN), is proposed. The guidance law is designed to intercept high-speed targets with angular constraint, which can be used for ballistic target interception. BRPN guidance law is defined, and the exact time-varying bias for a required impact angle is derived. Furthermore, the simulation results (trajectory, variation of navigation ratio, capture region, etc) are compared with those of biased proportional navigation (BPN), proportional navigation and retro-proportional navigation. The results show that, at the cost of a higher intercept time, BRPN demands lower terminal lateral acceleration and has larger capture region compared to BPN.     

复杂约束下的导弹作战任务规划模型和算法研究*

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题.首先通过定叉约束满足效用对基本约束满足模型进行了扩展,建立了导弹任务规划的约束满足优化模型.在此基础上,研究了任务规划模型求解的时间和效用传播算法,提出了基于综合效用的优化求解框架.该模型和求解框架易于解决具有多种约束因素的复杂问题,具有较好的通用性.通过定义软、硬约束效用,使得实际任务规划问题求解具有更好的灵活性.     

带落角约束的再入机动弹头的复合导引律

针对再入机动弹头垂直打击目标的要求,研究了具有末端落角约束的复合导引律.该导引律包括俯冲平面内的制导方程和转弯平面内的制导方程,通过在最优导引律的基础上引入滑模变结构控制,增强导引律的鲁棒性.为了减小控制量的抖振和能量损耗,提出了采用RBF(径向基函数)神经网络自适应调节切换项增益的方案,数学仿真验证了该方案的有效性.仿真结果还表明,与最优导引律相比,复合导引律在外界干扰的影响下仍能保持较高的制导精度.     

线性无阻尼半正定振动系统简明正定化方法

从线性无阻尼半正定振动系统运动微分方程出发,分析得出系统作自由振动时具有内部惯性力守恒、振动动量守恒以及质心守恒等3个基本物理属性.在此基础上,给出了简明的正定化方法,并证明了该方法的普适性,数值算例也验证了其正确性.与"物理约束"法相比,文中提出的正定化方法规则简单,计算量小,适用于理论推导、计算机编程和数值计算.     

一种直线段匹配的新方法

直线特征在人造目标和环境中普遍存在,直线段的匹配是三维重建等应用领域的首要解决问题.一般单直线的匹配方法难以解决被部分遮挡直线的匹配问题,提出了一种基于极线约束和RANSAC算法的匹配方法.对直线段上的点运用基于极线约束的匹配方法在另一幅图像中进行点的同名匹配,采用RANSAC算法建立直线模型,剔除野值,得到匹配直线段.本方法能有效地解决图像中被部分遮挡直线段的匹配问题,仿真实验和实际图像实验证实了本算法的正确性和高精度.     

Chance‐constrained multi‐terminal network design problems

We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015     

敏捷成像卫星自主规划模型与算法

针对敏捷成像卫星自主规划问题,将规划、决策、执行和信息反馈相结合,提出星上自主规划框架,并介绍框架结构和模块功能。在分析主要约束条件的基础上,建立基于时间线约束网络的问题模型。通过将各种卫星动作前后衔接,组合成能够完成不同任务的动作序列,提出一种面向卫星动作序列的启发式算法。该算法分为规划和决策两个部分,并在卫星执行每一个动作序列的同时基于多种启发式规则进行规划,在动作序列执行结束时进行决策。实验结果表明了自主规划框架和模型的合理性以及算法的有效性。     

具有终端约束的制导炸弹模糊变结构制导律设计

针对INS/GPS制导炸弹对地面目标的精确打击问题,提出带落角约束的模糊变结构制导律。在变结构制导律的基础上,引入终端落角约束项,应用模糊规则对所设计制导律中的变结构开关项系数增益进行在线调节。仿真结果表明,在对地面目标进行攻击时,该制导律降低变结构控制系统的抖振,同时满足制导精度和期望落角的要求,具有有效性和鲁棒性。     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003